Computable processes and bisimulation equivalence

Decidability of Bisimulation Equivalence for Pushdown Processes

We show that bisimulation equivalence is decidable for pushdown automata without ǫ-transitions.

Bisimulation and Language Equivalence

One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words). Properties of systems are described in a linear time temporal logic. Relationships between automata, language theory and logic are then utilised, such as the theory of ω-regular languages and Büchi automata. An alternative viewpoint is that an interactive system should b...

Epistemic Equivalence and Bisimulation

Bisimulation is an equivalence relation over Kripke models. It is often claimed, but little argued for, that bisimulation captures a ‘natural’ notion of similarity in epistemic semantics, in the sense that the differences between bisimilar models are, from an epistemic point of view, irrelevant. In this paper we examine three types of arguments pertaining to the view that bisimilar models are ‘...

Bisimulation Equivalence is Decidable for all Context-Free Processes

Bisimulation Equivalence is Decidable for One-Counter Processes

It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter, in fact. Also regularity, i.e. bisimulation equivalence with some finite-state process, is shown to be decidable for the mentioned processes.